Compiler Optimization: A Case for the Transformation Tool Contest
نویسندگان
چکیده
An optimizing compiler consists of a front end parsing a textual programming language into an intermediate representation (IR), a middle end performing optimizations on the IR, and a back end lowering the IR to a target representation (TR) built of operations supported by the target hardware. In modern compiler construction graph-based IRs are employed. Optimization and lowering tasks can then be implemented with graph transformation rules.
منابع مشابه
Solving the TTC 2011 Compiler Optimization Case with QVTR-XSLT
In this short paper we present our solution for the Compiler Optimization case study [1] of the Transformation Tool Contest (TTC) 2011 using the QVTR-XSLT tool [2]. The tool supports editing and execution of the graphical notation of QVT Relations language [6]. The case study addresses the problem of optimizing the intermediate representation of compiled program code. This problem consists of t...
متن کاملSolving the TTC 2011 Compiler Optimization Task with metatools
The authors’ meta tools are a collection of tools for generic programming. This includes generating Java sources from mathematically well-founded specifications, as well as the creation of strictly typed document object models for XML encoded texts. In this context, almost every computer-internal structure is treated as a “model”, and every computation is a kind of model transformation. This co...
متن کاملBPMN2BPEL transformation with Fujaba - a Case Study
We have modeled a BPMN to BPEL synthesis transformation for the GraBaTs 2009 Tool Contest with the Fujaba Tool Suite. The basic problem of transformation is to create a hierachical a block structure out of a given flow graph. We use the same approach as already successfully implemented in the Fujaba code generator CodeGen2, which transforms amongst others SDM diagrams with arbitrary control flo...
متن کاملThe Petri-Nets to Statecharts Transformation Case
This paper describes a case study for the sixth Transformation Tool Contest. The case is based on a mapping from Petri-Nets to statecharts (i.e., from flat process models to hierarchical ones). The case description separates a simple mapping phase from a phase that involves the step by step destruction Petri-Net elements and the corresponding construction of a hierarchy of statechart elements. ...
متن کاملA Solution to the FIXML Case Study Using Triple Graph Grammars and eMoflon
Triple Graph Grammars (TGGs) are a bidirectional model transformation language, which has been successfully used in different application scenarios over the years. Our solution for the FIXML case study of the Transformation Tool Contest (TTC 2014) is implemented using TGGs and eMoflon (www.emoflon.org), a meta-modelling and model transformation tool developed at the Real-Time Systems Lab of TU ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011